Interpolation Mixed with I2-Approximation
نویسندگان
چکیده
منابع مشابه
Function Approximation 1 Interpolation
Interpolation is a form of function approximation in which the approximating function (interpolant) and the underlying function must agree at a finite number of points. In some cases additional restrictions may be imposed on the interpolant. For example its first derivative evaluated at a finite number of points may have to agree with that of the underlying function. Other examples include addi...
متن کاملScattered data approximation of fully fuzzy data by quasi-interpolation
Fuzzy quasi-interpolations help to reduce the complexity of solving a linear system of equations compared with fuzzy interpolations. Almost all fuzzy quasi-interpolations are focused on the form of $widetilde{f}^{*}:mathbb{R}rightarrow F(mathbb{R})$ or $widetilde{f}^{*}:F(mathbb{R})rightarrow mathbb{R}$. In this paper, we intend to offer a novel fuzzy radial basis function by the concept of so...
متن کاملMultilevel Interpolation and Approximation
Interpolation by translates of a given radial basis function (RBF) has become a well-recognized means of tting functions sampled at scattered sites in R d. A major drawback of these methods is their inability to interpolate very large data sets in a numerically stable way while maintaining a good t. To circumvent this problem, a multilevel interpolation (ML) method for scattered data was presen...
متن کاملInterpolation and approximation in decoding
Recently Sudan formulated a decoding procedure for decoding RScodes beyond the packing radius. The potential of the method for AGcodes was recognized by Shokrollahi and Wasserman. We discuss similarities and differences with some previous algebraic decoding procedures.
متن کاملMixed Bregman Clustering with Approximation Guarantees
Two recent breakthroughs have dramatically improved the scope and performance of k-means clustering: squared Euclidean seeding for the initialization step, and Bregman clustering for the iterative step. In this paper, we first unite the two frameworks by generalizing the former improvement to Bregman seeding — a biased randomized seeding technique using Bregman divergences — while generalizing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1995
ISSN: 0021-9045
DOI: 10.1006/jath.1995.1120